Hierarchical Queue-Based Task Scheduling
نویسندگان
چکیده
منابع مشابه
Dynamic energy aware task scheduling using run-queue peek
Scheduling dependent tasks is one of the most challenging problems in parallel and distributed systems. It is known to be computationally intractable in its general form as well as several restricted cases. An interesting application of scheduling is in the area of energy awareness for mobile battery operated devices where minimizing the energy utilized is the most important scheduling policy c...
متن کاملRadar Task Schedulers based on Multiple Queue
There are very complex communication systems, as the multifunction radar, MFAR (Multi-Function Array Radar), where functions are integrated all together, and simultaneously are performed the classic functions of tracking and surveillance, as all the functions related to the communication, countermeasures, and calibration. All these functions are divided into the tasks to execute. The task sched...
متن کاملModified Hierarchical Method for Task Scheduling in Grid Systems
This study aims to increase the productivity of grid systems by an improved scheduling method. A brief overview and analysis of the main scheduling methods in grid systems are presented. A method for increasing efficiency by optimizing the task graph structure considering the grid system node structure is proposed. Task granularity (the ratio between the amount of computation and transferred da...
متن کاملSimulation of hierarchical real-time task scheduling algorithms using DGridSim
Real-time Data Grid applications are emerging in many disciplines of science and engineering. In order to run these applications while meeting the real-time constraints associated with them, the Data Grid infrastructure should be designed to respect these constraints and allocate its computing, networking, storage, and the other resources accordingly. In this study, a process oriented and discr...
متن کاملA Hierarchical CLH Queue Lock
Modern multiprocessor architectures such as CC-NUMAmachines or CMPs have nonuniform communication architectures that render programs sensitive to memory access locality. A recent paper by Radović and Hagersten shows that performance gains can be obtained by developing general-purpose mutual-exclusion locks that encourage threads with high mutual memory locality to acquire the lock consecutively...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Advances in Computer Networks
سال: 2014
ISSN: 1793-8244
DOI: 10.7763/jacn.2014.v2.98